Symmetry-making and -breaking in visual art
نویسندگان
چکیده
منابع مشابه
A Model of Symmetry Breaking in Collective Decision-Making
Symmetry breaking is commonly found in self-organized collective decision making. It serves an important functional role, specifically in biological and bio-inspired systems. The analysis of symmetry breaking is thus an important key to understanding self-organized decision making. However, in many systems of practical importance available analytic methods cannot be applied due to the complexit...
متن کاملSymmetry, Symmetry Breaking and Topology
The ground state of a system with symmetry can be described by a group G. This symmetry groupG can be discrete or continuous. Thus for a crystalG is a finite group while for the vacuum state of a grand unified theory G is a continuous Lie group. The ground state symmetry described by G can change spontaneously from G to one of its subgroups H as the external parameters of the system are modifie...
متن کاملSymmetry and Symmetry Breaking in Electrostatic MEMS
The use of electrostatic forces to provide actuation is a method of central importance in microelectromechanical systems (MEMS) and is of growing importance in nanoelectromechanical systems (NEMS). The study of electrostatic actuation has led to numerous interesting experimental, theoretical, and numerical results. Yet, surprisingly, even simple electrostatically actuated systems have secrets t...
متن کاملSymmetry and Symmetry Breaking in Software Patterns
Software patterns draw on the work of the architect Christopher Alexander, which in turn builds on foundations that may be more suitable to software than the architectural metaphors themselves. Patterns have a longstanding identity in the scientific community as results of a phenomenon called symmetry breaking. Symmetry breaking can be defined formally in terms of group theory. We establish for...
متن کاملSymmetry Breaking in Tournaments
We provide upper bounds for the determining number and the metric dimension of tournaments. A set of vertices S ⊆ V (T ) is a determining set for a tournament T if every nontrivial automorphism of T moves at least one vertex of S, while S is a resolving set for T if every two distinct vertices in T have different distances to some vertex in S. We show that the minimum size of a determining set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1986
ISSN: 0898-1221
DOI: 10.1016/0898-1221(86)90155-0